0.00/0.02	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM
0.10/0.37	% Computer : n008.cluster.edu
0.10/0.37	% Model    : x86_64 x86_64
0.10/0.37	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.37	% Memory   : 8046.5625MB
0.10/0.37	% OS       : Linux 6.8.0-71-generic
0.10/0.37	% CPULimit : 1440
0.10/0.37	% WCLimit  : 180
0.10/0.37	% DateTime : Mon Jul 27 10:09:27 UTC 2026
0.10/0.37	% CPUTime  : 
0.10/0.37	Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM
0.10/0.42	Running higher-order theorem proving
0.10/0.43	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.taZuXrnzcE/E---3.1_992009.p
0.10/0.45	% Version: 3.5.1-ho
0.10/0.45	% Preprocessing class: HSSSSMSSSLSNHSA.
0.10/0.45	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.10/0.45	% Starting post_as_ho12 with 900s (5) cores
0.10/0.45	% Starting post_as_ho4 with 180s (1) cores
0.10/0.45	% Starting lpo8_s with 180s (1) cores
0.10/0.45	% Starting sh5l with 180s (1) cores
0.10/0.45	% lpo8_s with pid 992024 completed with status 0
0.10/0.45	% Result found by lpo8_s
0.10/0.45	% Preprocessing class: HSSSSMSSSLSNHSA.
0.10/0.45	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.10/0.45	% Starting post_as_ho12 with 900s (5) cores
0.10/0.45	% Starting post_as_ho4 with 180s (1) cores
0.10/0.45	% Starting lpo8_s with 180s (1) cores
0.10/0.45	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
0.10/0.45	% SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
0.10/0.45	% Search class: HUUPS-FFSF11-SHSFMFNN
0.10/0.45	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.10/0.45	% Starting SubtermCWHack with 17s (1) cores
0.10/0.45	% SubtermCWHack with pid 992026 completed with status 0
0.10/0.45	% Result found by SubtermCWHack
0.10/0.45	% Preprocessing class: HSSSSMSSSLSNHSA.
0.10/0.45	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.10/0.45	% Starting post_as_ho12 with 900s (5) cores
0.10/0.45	% Starting post_as_ho4 with 180s (1) cores
0.10/0.45	% Starting lpo8_s with 180s (1) cores
0.10/0.45	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,4.0,,6,20000,1.0))
0.10/0.45	% SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
0.10/0.45	% Search class: HUUPS-FFSF11-SHSFMFNN
0.10/0.45	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.10/0.45	% Starting SubtermCWHack with 17s (1) cores
0.10/0.45	% Preprocessing time       : 0.001 s
0.10/0.45	
0.10/0.45	% Proof found!
0.10/0.45	% SZS status Theorem
0.10/0.45	% SZS output start CNFRefutation
0.10/0.45	thf(decl_sort1, type, g: $tType).
0.10/0.45	thf(decl_23, type, cGRP_RIGHT_INVERSE: (g > g > g) > g > $o).
0.10/0.45	thf(decl_24, type, cGRP_RIGHT_UNIT: (g > g > g) > g > $o).
0.10/0.45	thf(decl_25, type, esk1_0: g > g > g).
0.10/0.45	thf(decl_26, type, esk2_0: g).
0.10/0.45	thf(decl_27, type, esk3_1: g > g).
0.10/0.45	thf(decl_28, type, esk4_0: g).
0.10/0.45	thf(cE13A2A, conjecture, ![X1:g > g > g, X2:g]:(((((cGRP_RIGHT_INVERSE @ X1 @ X2)&(cGRP_RIGHT_UNIT @ X1 @ X2))&![X4:g, X5:g, X3:g]:(((X1 @ (X1 @ X3 @ X4) @ X5)=(X1 @ X3 @ (X1 @ X4 @ X5)))))=>![X3:g]:(((X1 @ X2 @ X3)=(X3))))), file('/export/starexec/sandbox2/tmp/tmp.taZuXrnzcE/E---3.1_992009.p', cE13A2A)).
0.10/0.45	thf(cGRP_RIGHT_UNIT_def, axiom, ((cGRP_RIGHT_UNIT)=(^[X1:g > g > g, X2:g]:(![X3:g]:(((X1 @ X3 @ X2)=(X3)))))), file('/export/starexec/sandbox2/tmp/tmp.taZuXrnzcE/E---3.1_992009.p', cGRP_RIGHT_UNIT_def)).
0.10/0.45	thf(cGRP_RIGHT_INVERSE_def, axiom, ((cGRP_RIGHT_INVERSE)=(^[X1:g > g > g, X2:g]:(![X3:g]:(?[X4:g]:(((X1 @ X3 @ X4)=(X2))))))), file('/export/starexec/sandbox2/tmp/tmp.taZuXrnzcE/E---3.1_992009.p', cGRP_RIGHT_INVERSE_def)).
0.10/0.45	thf(c_0_3, negated_conjecture, ~(![X1:g > g > g, X2:g]:(((((cGRP_RIGHT_INVERSE @ X1 @ X2)&(cGRP_RIGHT_UNIT @ X1 @ X2))&![X4:g, X5:g, X3:g]:(((X1 @ (X1 @ X3 @ X4) @ X5)=(X1 @ X3 @ (X1 @ X4 @ X5)))))=>![X3:g]:(((X1 @ X2 @ X3)=(X3)))))), inference(assume_negation,[status(cth)],[cE13A2A])).
0.10/0.45	thf(c_0_4, plain, ((cGRP_RIGHT_UNIT)=(^[Z0:g > g > g, Z1:g]:(![X3:g]:(((Z0 @ X3 @ Z1)=(X3)))))), inference(fof_simplification,[status(thm)],[cGRP_RIGHT_UNIT_def])).
0.10/0.45	thf(c_0_5, plain, ((cGRP_RIGHT_INVERSE)=(^[Z0:g > g > g, Z1:g]:(![X3:g]:(?[X4:g]:(((Z0 @ X3 @ X4)=(Z1))))))), inference(fof_simplification,[status(thm)],[cGRP_RIGHT_INVERSE_def])).
0.10/0.45	thf(c_0_6, negated_conjecture, ~(![X1:g > g > g, X2:g]:((((![X12:g]:(?[X13:g]:(((X1 @ X12 @ X13)=(X2))))&![X14:g]:(((X1 @ X14 @ X2)=(X14))))&![X4:g, X5:g, X3:g]:(((X1 @ (X1 @ X3 @ X4) @ X5)=(X1 @ X3 @ (X1 @ X4 @ X5)))))=>![X3:g]:(((X1 @ X2 @ X3)=(X3)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3, c_0_4]), c_0_5])).
0.10/0.45	thf(c_0_7, negated_conjecture, ![X17:g, X19:g, X20:g, X21:g, X22:g]:((((((esk1_0 @ X17 @ (esk3_1 @ X17))=(esk2_0))&((esk1_0 @ X19 @ esk2_0)=(X19)))&((esk1_0 @ (esk1_0 @ X22 @ X20) @ X21)=(esk1_0 @ X22 @ (esk1_0 @ X20 @ X21))))&((esk1_0 @ esk2_0 @ esk4_0)!=(esk4_0)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])).
0.10/0.45	thf(c_0_8, negated_conjecture, ![X2:g, X3:g, X4:g]:(((esk1_0 @ (esk1_0 @ X2 @ X3) @ X4)=(esk1_0 @ X2 @ (esk1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.10/0.45	thf(c_0_9, negated_conjecture, ![X2:g]:(((esk1_0 @ X2 @ esk2_0)=(X2))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.10/0.45	thf(c_0_10, negated_conjecture, ![X2:g]:(((esk1_0 @ X2 @ (esk3_1 @ X2))=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.10/0.45	thf(c_0_11, negated_conjecture, ![X2:g, X3:g]:(((esk1_0 @ X2 @ (esk1_0 @ esk2_0 @ X3))=(esk1_0 @ X2 @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
0.10/0.45	thf(c_0_12, negated_conjecture, ![X2:g, X3:g]:(((esk1_0 @ X2 @ (esk1_0 @ X3 @ (esk3_1 @ (esk1_0 @ X2 @ X3))))=(esk2_0))), inference(spm,[status(thm)],[c_0_10, c_0_8])).
0.10/0.45	thf(c_0_13, negated_conjecture, ![X2:g, X3:g]:(((esk1_0 @ X2 @ (esk1_0 @ (esk3_1 @ X2) @ X3))=(esk1_0 @ esk2_0 @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_10])).
0.10/0.45	thf(c_0_14, negated_conjecture, ![X3:g, X2:g]:(((esk1_0 @ X2 @ (esk1_0 @ X3 @ (esk3_1 @ (esk1_0 @ esk2_0 @ X3))))=(X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_9])).
0.10/0.45	thf(c_0_15, negated_conjecture, ![X2:g]:(((esk1_0 @ esk2_0 @ (esk3_1 @ (esk1_0 @ esk2_0 @ (esk3_1 @ X2))))=(X2))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
0.10/0.45	thf(c_0_16, negated_conjecture, ![X2:g]:(((esk1_0 @ esk2_0 @ (esk3_1 @ (esk3_1 @ X2)))=(X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_10]), c_0_9])).
0.10/0.45	thf(c_0_17, negated_conjecture, ![X2:g]:(((esk1_0 @ esk2_0 @ (esk3_1 @ X2))=(esk3_1 @ X2))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.10/0.45	thf(c_0_18, negated_conjecture, ![X2:g]:(((esk3_1 @ (esk3_1 @ X2))=(X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_17]), c_0_17])).
0.10/0.45	thf(c_0_19, negated_conjecture, ((esk1_0 @ esk2_0 @ esk4_0)!=(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.10/0.45	thf(c_0_20, negated_conjecture, ![X2:g]:(((esk1_0 @ esk2_0 @ X2)=(X2))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.10/0.45	thf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])]), ['proof']).
0.10/0.45	% SZS output end CNFRefutation
0.10/0.45	% Parsed axioms                        : 6
0.10/0.45	% Removed by relevancy pruning/SinE    : 3
0.10/0.45	% Initial clauses                      : 4
0.10/0.45	% Removed in clause preprocessing      : 0
0.10/0.45	% Initial clauses in saturation        : 4
0.10/0.45	% Processed clauses                    : 18
0.10/0.45	% ...of these trivial                  : 2
0.10/0.45	% ...subsumed                          : 0
0.10/0.45	% ...remaining for further processing  : 16
0.10/0.45	% Other redundant clauses eliminated   : 0
0.10/0.45	% Clauses deleted for lack of memory   : 0
0.10/0.45	% Backward-subsumed                    : 0
0.10/0.45	% Backward-rewritten                   : 7
0.10/0.45	% Generated clauses                    : 93
0.10/0.45	% ...of the previous two non-redundant : 40
0.10/0.45	% ...aggressively subsumed             : 0
0.10/0.45	% Contextual simplify-reflections      : 0
0.10/0.45	% Paramodulations                      : 93
0.10/0.45	% Factorizations                       : 0
0.10/0.45	% NegExts                              : 0
0.10/0.45	% Equation resolutions                 : 0
0.10/0.45	% Disequality decompositions           : 0
0.10/0.45	% Total rewrite steps                  : 128
0.10/0.45	% ...of those cached                   : 73
0.10/0.45	% Propositional unsat checks           : 0
0.10/0.45	%    Propositional check models        : 0
0.10/0.45	%    Propositional check unsatisfiable : 0
0.10/0.45	%    Propositional clauses             : 0
0.10/0.45	%    Propositional clauses after purity: 0
0.10/0.45	%    Propositional unsat core size     : 0
0.10/0.45	%    Propositional preprocessing time  : 0.000
0.10/0.45	%    Propositional encoding time       : 0.000
0.10/0.45	%    Propositional solver time         : 0.000
0.10/0.45	%    Success case prop preproc time    : 0.000
0.10/0.45	%    Success case prop encoding time   : 0.000
0.10/0.45	%    Success case prop solver time     : 0.000
0.10/0.45	% Current number of processed clauses  : 9
0.10/0.45	%    Positive orientable unit clauses  : 9
0.10/0.45	%    Positive unorientable unit clauses: 0
0.10/0.45	%    Negative unit clauses             : 0
0.10/0.45	%    Non-unit-clauses                  : 0
0.10/0.45	% Current number of unprocessed clauses: 24
0.10/0.45	% ...number of literals in the above   : 24
0.10/0.45	% Current number of archived formulas  : 0
0.10/0.45	% Current number of archived clauses   : 7
0.10/0.45	% Clause-clause subsumption calls (NU) : 0
0.10/0.45	% Rec. Clause-clause subsumption calls : 0
0.10/0.45	% Non-unit clause-clause subsumptions  : 0
0.10/0.45	% Unit Clause-clause subsumption calls : 0
0.10/0.45	% Rewrite failures with RHS unbound    : 0
0.10/0.45	% BW rewrite match attempts            : 9
0.10/0.45	% BW rewrite match successes           : 6
0.10/0.45	% Condensation attempts                : 0
0.10/0.45	% Condensation successes               : 0
0.10/0.45	% Termbank termtop insertions          : 1249
0.10/0.45	% Search garbage collected termcells   : 158
0.10/0.45	
0.10/0.45	% -------------------------------------------------
0.10/0.45	% User time                : 0.002 s
0.10/0.45	% System time              : 0.004 s
0.10/0.45	% Total time               : 0.006 s
0.10/0.45	% Maximum resident set size: 3632 pages
0.10/0.45	
0.10/0.45	% -------------------------------------------------
0.10/0.45	% User time                : 0.003 s
0.10/0.45	% System time              : 0.009 s
0.10/0.45	% Total time               : 0.012 s
0.10/0.45	% Maximum resident set size: 4864 pages
0.10/0.45	% E exiting
0.10/0.45	EOF